github.com/andybalholm/brotli.blockEncoder.depths_ (field)

20 uses

	github.com/andybalholm/brotli (current package)
		brotli_bit_stream.go#L1008: 	depths_           []byte
		brotli_bit_stream.go#L1020: 		self.depths_ = self.depths_[:0]
		brotli_bit_stream.go#L1073: 		writeBits(uint(self.depths_[ix]), uint64(self.bits_[ix]), storage_ix, storage)
		brotli_bit_stream.go#L1098: 		writeBits(uint(self.depths_[ix]), uint64(self.bits_[ix]), storage_ix, storage)
		brotli_bit_stream.go#L1104: 	if cap(self.depths_) < int(table_size) {
		brotli_bit_stream.go#L1105: 		self.depths_ = make([]byte, table_size)
		brotli_bit_stream.go#L1107: 		self.depths_ = self.depths_[:table_size]
		brotli_bit_stream.go#L1118: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1125: 	if cap(self.depths_) < int(table_size) {
		brotli_bit_stream.go#L1126: 		self.depths_ = make([]byte, table_size)
		brotli_bit_stream.go#L1128: 		self.depths_ = self.depths_[:table_size]
		brotli_bit_stream.go#L1139: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1146: 	if cap(self.depths_) < int(table_size) {
		brotli_bit_stream.go#L1147: 		self.depths_ = make([]byte, table_size)
		brotli_bit_stream.go#L1149: 		self.depths_ = self.depths_[:table_size]
		brotli_bit_stream.go#L1160: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)